Parser Which Learns the Application Order of Rewriting Rules

نویسندگان

  • Makoto Nagao
  • Jun-ichi Nakamura
چکیده

The efficiency of syntactic analysis by using a set of rewriting rules is greatly influenced by the order or the arrangement of the rules for the application. There are some trials which subdivide the set of rules into subsets and specify the sequence of rule applications, thus avoiding the useless rule applicagions [i]. But the subdivision of the rule set and the specification of the sequence of rule applications are not so easy for the establishment of the most efficient analysis system. We have developed a rewriting rule system which can manipulate arbitrary list of trees. The control mechanism of this system can adjust the weight of the rewriting rules, and can analyze the most plausible sentential structure f t, thus realizing the fast syntact analysis. The system learns (so to s[ ) the weight of importance of the reutiting rules during the analysis of~ input sentences.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Order of Rewriting

The efficiency of syntactic analysis by using a set of rewriting rules is greatly influenced by the order or the arrangement of the rules for the application. There are some trials which subdivide the set of rules into subsets and specify the sequence of rule applications, thus avoiding the useless rule applicagions [i]. But the subdivision of the rule set and the specification of the sequence ...

متن کامل

Learning Rewrite Rules versus Search Control Rules to Improve Plan Quality

Domain independent planners can produce better-quality plans through the use of domain-speci c knowledge, typically encoded as search control rules. The planning-by-rewriting approach has been proposed as an alternative technique for improving plan quality. We present a system that automatically learns plan rewriting rules and compare it with a system that automatically learns search control ru...

متن کامل

Learned rewrite rules versus learned search control rules to improveplan qualityMuhammad

Domain independent planners can produce better-quality plans through the use of domain-dependent knowledge , typically encoded as search control rules. The planning-by-rewriting approach has been proposed as an alternative technique for improving plan quality. We present a system called Sys-REWRITE that automatically learns plan rewriting rules and compare it with Sys-SEARCH-CONTROL, a system t...

متن کامل

An Inductive Logic Programming Method for Corpus-based Parser Construction

Empirical methods for building natural language systems has become an important area of research in recent years. Most current approaches are based on propositional learning algorithms and have been applied to the problem of acquiring broad-coverage parsers for relatively shallow (syntactic) representations. This paper outlines an alternative empirical approach based on techniques from a sub el...

متن کامل

Feature Engineering in Persian Dependency Parser

Dependency parser is one of the most important fundamental tools in the natural language processing, which extracts structure of sentences and determines the relations between words based on the dependency grammar. The dependency parser is proper for free order languages, such as Persian. In this paper, data-driven dependency parser has been developed with the help of phrase-structure parser fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1982